Naturally Embedded Query Languages

نویسندگان

  • Val Tannen
  • Peter Buneman
  • Limsoon Wong
چکیده

We investigate the properties of a simple programming language whose main computational engine is structural recursion on sets. We describe a progression of sublanguages in this paradigm that (1) have increasing expressive power, and (2) illustrate robust conceptual restrictions thus exhibiting interesting additional properties. These properties suggest that we consider our sublanguages as candidates for "query languages". Viewing query languages as restrictions of our more general programming language has several advantages. First, there is no "impedance mismatch problem; the query languages are already there, so they share common semantic foundation with the general language. Second, we suggest a uniform characterization of nested relational and complex-object algebras in terms of some surprisingly simple operators; and we can make comparisons of expressiveness in a general framework. Third, we exhibit differences in expressive power that are not always based on complexity arguments, but use the idea that a query in one language may not be polymorphically expressible in another. Fourth, ideas of category theory can be profitably used to organize semantics and syntax, in particular our minimal (core) language is a well-understood categorical construction: a cartesian category with a strong monad on it. Finally, we bring out an algebraic perspective, that is, our languages come with equational theories, and categorical ideas can be used to derive a number of rather general identities that may serve as optimizations or as techniques for discovering optimizations. Comments University of Pennsylvania Department of Computer and Information Science Technical Report No. MSCIS-92-47. This technical report is available at ScholarlyCommons: http://repository.upenn.edu/cis_reports/508 Naturally Embedded Query Languages MS-CIS-92-47 LOGIC & COMPUTATION 47 Val Breazu-Tannen Peter Bulleman Limsoon Wong University of Pennsylvania School of Engineering and Applied Science Computer and Information Science Department Philadelphia, PA 19104-6389

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

انتخاب مناسب‌ترین زبان پرس‌وجو برای استفاده از فرا‌‌پیوندها جهت استخراج داده‌ها در حالت دیتالوگ در سامانه پایگاه داده استنتاجی DES

Deductive Database systems are designed based on a logical data model. Data (as opposed to Relational Databases Management System (RDBMS) in which data stored in tables) are saved as facts in a Deductive Database system. Datalog Educational System (DES) is a Deductive Database system that Datalog mode is the default mode in this system. It can extract data to use outer joins with three query la...

متن کامل

Extending Deductive Database Languages by Embedded Implications 1

A bottom-up, set-oriented evaluation scheme for a deductive database query language with embedded implications is deened. An embedded implication deenes a local extension of the set of rules available for answering a goal. It can therefore be viewed either as a hypothetical query or as a reference to some external program. We deene an iterated xpoint semantics for stratiiable deductive database...

متن کامل

A Comparison of Self-Contained and Embedded Database Languages

The purpose of this paper is to compare self-contained and embedded database languages. An overview is presented, summarising the differences between the two types. It is observed that the principle differences stem from the fact that many things are prespecified in the self-contained languages. It is then argued, that these prespecifications can be carried over to the embedded languages, there...

متن کامل

Naturally Embedded DSLs

Domain-specific languages can be embedded in a variety of ways within a host language. The choice of embedding approach entails significant tradeoffs in the usability of the embedded DSL. We argue embedding DSLs naturally within the host language results in the best experience for end users of the DSL. A naturally embedded DSL is one that uses natural syntax, static semantics, and dynamic seman...

متن کامل

Implementing Embedded Valid Time Query Languages

Application development on top of database systems is heavily based on the existence of embedded and 4GL languages. However, the issue of designing and implementing embedded or 4GL temporal languages has not been addressed insofar. In this paper, we present a design approach for implementing an embedded temporal language that supports valid time. Furthermore, we introduce implementation techniq...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1992